Exploiting Routing Redundancy Using a Wide-area Overlay

نویسندگان

  • Ben Y. Zhao
  • Ling Huang
  • Anthony D. Joseph
  • John D. Kubiatowicz
چکیده

As new and interesting peer-to-peer applications combine with advancements in networking technology, they are reaching millions of users across the globe. Numerous studies have shown, however, that loss of connectivity is common on the wide-area network, due to hardware and software failures, and network misconfigurations. Despite the natural redundancy present in underlying network links, the current IP layer fails to recognize and recover from these frequent failures in a timely fashion. This paper presents fault-tolerant routing on the Tapestry overlay network, which exploits existing network redundancy by dynamically switching traffic onto precomputed alternate routes. Furthermore, messages in our system can be duplicated and multicast “around” network congestion and failure hotspots with rapid reconvergence to drop duplicates. Our simulations show fault-tolerant Tapestry to be highly effective at circumventing link and node failures, with reasonable cost in terms of additional routing latency and bandwidth cost.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

JITeR: Just-in-time application-layer routing

The paper addresses the problem of providing message latency and reliability assurances for control traffic in wide-area IP networks. This is an important problem for cloud services and other geo-distributed information infrastructures that entail inter-datacenter real-time communication. We present the design and validation of JITeR (Just-In-Time Routing), an algorithm that timely routes messa...

متن کامل

S U M a N N a T H Dissertation: " Exploiting Redundancy for Robust Sensing " Dissertation Research Honors and Awards

Exploiting Redundancy for Robust Sensing In my thesis research, I have shown that several unique properties of hybrid sensing services (built on embedded sensors like motes or more capable sensors like webcams) can be efficiently exploited to make the services highly robust. For wireless sensor networks, I have shown how to exploit the underlying broadcast medium for robust computation of aggre...

متن کامل

Routing on Overlay Graphs in Mobile Ad Hoc Networks

Geometric routing using source-destination locations has been widely suggested as a scalable alternative to conventional routing approaches in mobile ad hoc networks. Recently, there has been considerable attention on face routing in planar graphs constructed from overlay graphs in wireless networks. Given a plane tiled into an infinite mesh of polygons, an overlay graph is defined as one in wh...

متن کامل

A High-performance Deadlock-free Overlay for Wide-area Parallel and Distributed Programming

Parallel and distributed computing in Wide-area environments is complicated by connectivity issues like NATs/firewalls, and dynamic changes in the available resources. Therefore, programming in these environments requires substantial support from programming frameworks. Such frameworks can help resolve low-level concerns while providing abstractions to implement applications more easily. Meanwh...

متن کامل

Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays

Structured peer-to-peer overlays provide a natural infrastructure for resilient routing via efficient fault detection and precomputation of backup paths. These overlays can respond to faults in a few hundred milliseconds by rapidly shifting between alternate routes. In this paper, we present two adaptive mechanisms for structured overlays and illustrate their operation in the context of Tapestr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002